CS 5220: Project 3 - All Pairs Shortest Path
نویسندگان
چکیده
We implement a modified Floyd-Warshall algorithm to solve the all-to-all shortest paths problem in O(n3 logn) time using MPI. Through the use of non-blocking round-robin message passing and other memory optimizations, we show super-linear speedup for a 4000 node graph problem, achieving a 23x speedup for 8 threads. In contrast, our reference OpenMP implementation achieved a 5x speedup for the same problem set executing 8 threads.
منابع مشابه
الگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملEstimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
In this paper we show that a very simple and efficient approach can be used to solve the all pairs almost shortest path problem on the class of weakly chordal graphs and its different subclasses. Moreover, this approach works well also on graphs with small size of largest induced cycle and gives a unified way to solve the all pairs almost shortest path and all pairs shortest path problems on di...
متن کاملCalculating Large All - Pair - Shortest - Path Matrices under Google MapReduce A project report of CS 736 Fall 2012
The all-pair-shortest-path (APSP) problem has a general application in many research fields. Different types of applications have different performance requirements. A traffic safety project in identifying spatially close crashes favors a pre-calculated APSP between all reference-sites in the roadway network. However, with the actual size of a practical statewide roadway network, the targeted A...
متن کاملFast Parallel Molecular Solution for Longest and Shortest Paths with Forbidden Pairs
Adleman demonstrate that we can deoxyribonucleic acid (DNA) strands to solve an instance of the Hamiltonian path problem (HPP). One year later, Lipton solved another NP hard problem. In this paper, we use this model for developing a new DNA algorithm to solve longest and shortest path with forbidden pairs. Our algorithm works in polynomial time.
متن کامل